Improving problem reduction for 0–1 Multidimensional Knapsack Problems with valid inequalities
نویسندگان
چکیده
منابع مشابه
Lifting valid inequalities for the precedence constrained knapsack problem
This paper considers the precedence constrained knapsack problem. More speci cally, we are interested in classes of valid inequalities which are facet-de ning for the precedence constrained knapsack polytope. We study the complexity of obtaining these facets using the standard sequential lifting procedure. Applying this procedure requires solving a combinatorial problem. For valid inequalities ...
متن کاملOn separating cover inequalities for the multidimensional knapsack problem
We propose a simple and a quite efficient separation procedure to identify cover inequalities for the multidimensional knapsack problem. It is based on the solution of a conventional integer programmingmodel. Solving this kind of integer programs is usually considered expensive and the proposed method may have been overlooked because of this assumption. The results of our experiments with a sma...
متن کاملA Hybrid Approach for the 01 Multidimensional Knapsack problem
& is called a knapsack constraint. The special case of the MKP01 with %*!) is the classical knapsack problem (KP01), whose usual statement is the following. Given a knapsack of capacity and objects, each being associated a profit (gain) and a volume occupation, one wants to select + ( +, and + not fixed) objects such that the total profit is maximized and the capacity of the knapsack is not exc...
متن کاملValid inequalities for a robust knapsack polyhedron - Application to the robust bandwidth packing problem
Knapsack cover inequalities are among the most frequently used cuts for solving 0-1 linear programs. In this paper, we propose adaptations of these classical valid inequalities to the case when knapsack items have uncertain weights. For modeling uncertainty, we focus on the robust framework proposed by Bertsimas and Sim (2003). Then, a robust version of the bandwidth packing problem is consider...
متن کاملAnt Algorithm for the Multidimensional Knapsack Problem
We propose a new algorithm based on the Ant Colony Optimization (ACO) meta-heuristic for the Multidimensional Knapsack Problem, the goal of which is to find a subset of objects that maximizes a given objective function while satisfying some resource constraints. We show that our new algorithm obtains better results than two other ACO algorithms on most instances.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2016
ISSN: 0305-0548
DOI: 10.1016/j.cor.2016.01.013